Embeddings into Free Heyting Algebras and Translations into Intuitionistic Propositional Logic
نویسنده
چکیده
We find a translation with particularly nice properties from intuitionistic propositional logic in countably many variables to intuitionistic propositional logic in two variables. In addition, the existence of a possibly-not-as-nice translation from any countable logic into intuitionistic propositional logic in two variables is shown. The nonexistence of a translation from classical logic into intuitionistic propositional logic which preserves ∧ and ∨ but not necessarily ⊤ is proven. These results about translations follow from additional results about embeddings into free Heyting algebras.
منابع مشابه
Generalized ordinal sums and translations
We extend the lattice embedding of the axiomatic extensions of the positive fragment of intuitionistic logic into the axiomatic extensions of intuitionistic logic to the setting of substructural logics. Our approach is algebraic and uses residuated lattices, the algebraic models for substructural logics. We generalize the notion of the ordinal sum of two residuated lattices and use it to obtain...
متن کاملThe Subvariety of Q-heyting Algebras Generated by Chains
The variety QH of Heyting algebras with a quantifier [14] corresponds to the algebraic study of the modal intuitionistic propositional calculus without the necessity operator. This paper is concerned with the subvariety C of QH generated by chains. We prove that this subvariety is characterized within QH by the equations ∇(x∧ y) ≈ ∇x∧∇y and (x → y)∨ (y → x) ≈ 1. We investigate free objects in C.
متن کاملFinitely Presented Heyting Algebras
In this paper we study the structure of finitely presented Heyting algebras. Using algebraic techniques (as opposed to techniques from proof-theory) we show that every such Heyting algebra is in fact coHeyting, improving on a result of Ghilardi who showed that Heyting algebras free on a finite set of generators are co-Heyting. Along the way we give a new and simple proof of the finite model pro...
متن کاملBoolean Algebras in Visser Algebras
We generalize the double negation construction of Boolean algebras in Heyting algebras, to a double negation construction of the same in Visser algebras (also known as basic algebras). This result allows us to generalize Glivenko’s Theorem from intuitionistic propositional logic and Heyting algebras to Visser’s basic propositional logic and Visser algebras. Mathematics Subject Classification: P...
متن کاملSemi-intuitionistic Logic with Strong Negation
There is a well known interplay between the study of algebraic varieties and propositional calculus of various logics. Prime examples of this are boolean algebras and classical logic, and Heyting algebras and intuitionistic logic. After the class of Heyting algebras was generalized to the semi-Heyting algebras by H. Sankappanavar in [San08], its logic counterpart was developed by one of us in [...
متن کامل